"Tri, Tri Again": Finding Triangles and Small Subgraphs in a Distributed Setting - (Extended Abstract)
نویسندگان
چکیده
Let G = (V,E) be an n-vertex graph and Md a d-vertex graph, for some constant d. Is Md a subgraph of G? We consider this problem in a model where all n processes are connected to all other processes, and each message contains up to O(logn) bits. A simple deterministic algorithm that requires O(n(d−2)/d/ logn) communication rounds is presented. For the special case that Md is a triangle, we present a probabilistic algorithm that requires an expected O(n/(t + 1)) rounds of communication, where t is the number of triangles in the graph, and O(min{n log n/(t + 1), n}) with high probability. We also present deterministic algorithms that are specially suited for sparse graphs. In graphs of maximum degree ∆, we can test for arbitrary subgraphs of diameter D in O(∆/n) rounds. For triangles, we devise an algorithm featuring a round complexity of O((A log2+n/A2 n)/n), where A denotes the arboricity of G.
منابع مشابه
"Tri, Tri again": Finding Triangles and Small Subgraphs in a Distributed Setting
Let G = (V,E) be an n-vertex graph and Md a d-vertex graph, for some constant d. Is Md a subgraph of G? We consider this problem in a model where all n processes are connected to all other processes, and each message contains up to O(log n) bits. A simple deterministic algorithm that requires O(n(d−2)/d/ log n) communication rounds is presented. For the special case that Md is a triangle, we pr...
متن کاملRegularity of Bounded Tri-Linear Maps and the Fourth Adjoint of a Tri-Derivation
In this Article, we give a simple criterion for the regularity of a tri-linear mapping. We provide if f : X × Y × Z −→ W is a bounded tri-linear mapping and h : W −→ S is a bounded linear mapping, then f is regular if and only if hof is regular. We also shall give some necessary and sufficient conditions such that the fourth adjoint D^∗∗∗∗ of a tri-derivation D is again tri-derivation.
متن کاملFinding Triangles and Small Subgraphs in a Distributed Setting
Let G = (V,E) be an n-vertex graph and Md a d-vertex graph, for some constant d. Is Md a subgraph of G? We consider this problem in a model where all n processes are connected to all other processes, and each message contains up to O(log n) bits. A simple deterministic algorithm that requires O(n(d−2)/d/ log n) communication rounds is presented. For the special case that Md is a triangle, we pr...
متن کاملSynthesis of tri and four substituted imidazoles derivatives using zinc oxid nanotubes modified by SiO2 as a powerful and reusable catalyst
In recent years, zinc oxid nanotubes have attracted much attention. The direct use of , zinc oxidnanotubes modified by SiO2 as recoverable catalysts for organic reactions is very rare. The catalystswere characterized by XRD. The average particle size of ZnO catalysts is 57 nm and there are highdensitydefects on nanotubes surfaces . A simple and efficient method for the imidazol derivativessynth...
متن کاملA Risk-averse Inventory-based Supply Chain Protection Problem with Adapted Stochastic Measures under Intentional Facility Disruptions: Decomposition and Hybrid Algorithms
Owing to rising intentional events, supply chain disruptions have been considered by setting up a game between two players, namely, a designer and an interdictor contesting on minimizing and maximizing total cost, respectively. The previous studies have found the equilibrium solution by taking transportation, penalty and restoration cost into account. To contribute further, we examine how incor...
متن کامل